The Minimum Cy le Cover and the Chinese Postman Problems on Mixed Graphs with Bounded Tree-Width
نویسندگان
چکیده
منابع مشابه
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Let M = (V, E, A) be a mixed graph with vertex set V , edge set E and arc set A. A cycle cover of M is a family C = {C1, . . . ,Ck} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is ∑k i=1 |Ci |. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small...
متن کاملLocal Tree-Width, Excluded Minors, and Approximation Algorithms
The local tree-width of a graph G = (V;E) is the function ltwG : N ! N that associates with every r 2 N the maximal tree-width of an r-neighborhood in G. Our main graph theoretic result is a decomposition theorem for graphs with excluded minors, which says that such graphs can be decomposed into trees of graphs of almost bounded local tree-width. As an application of this theorem, we show that ...
متن کاملP6- and triangle-free graphs revisited: structure and bounded clique-width
The MaximumWeight Stable Set (MWS) Problem is one of the fundamental problems on graphs. It is well-known to be NP-complete for triangle-free graphs, and Mosca has shown that it is solvable in polynomial time when restricted to P6and triangle-free graphs. We give a complete structure analysis of (nonbipartite) P6and triangle-free graphs which are prime in the sense of modular decomposition. It ...
متن کاملUsing Neighborhood Diversity to Solve Hard Problems
Parameterized algorithms are a very useful tool for dealing with NP-hard problems on graphs. Yet, to properly utilize parameterized algorithms it is necessary to choose the right parameter based on the type of problem and properties of the target graph class. Tree-width is an example of a very successful graph parameter, however it cannot be used on dense graph classes and there also exist prob...
متن کاملOn Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width
Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the number of edges between these two sets. We consider this problem in bounded degree graphs with a given tree decomposition (T,X ) and prove an upper bound for their minimum bisection width in terms of the structure and width of (T,X ). When (T,X ) is provided as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990